翻訳と辞書 Words near each other ・ Sumanirole ・ Sumanoh Kapen ・ Sumant Jayakrishnan ・ Sumant Misra ・ Sumant Moolgaokar ・ Sumant Sinha ・ Sumanta Baruah ・ Sumanth ・ Sumanth Art Productions ・ Sum (Unix) ・ Sum 41 ・ Sum 41 discography ・ Sum activity of peripheral deiodinases ・ Sum addressed decoder ・ Sum Alahi Mong ・ Sum and Product Puzzle ・ Sum and Substance ・ Sum certain ・ Sum Elai-Mang ・ Sum frequency generation spectroscopy ・ Sum Mo Chikan ・ Sum of absolute differences ・ Sum of absolute transformed differences ・ Sum of angles of a triangle ・ Sum of Christianity ・ Sum of Logic ・ Sum of normally distributed random variables ・ Sum of Parts ・ Sum of perpetuities method ・ Sum of public power Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Sum and Product Puzzle ： ウィキペディア英語版 Sum and Product Puzzle The Impossible Puzzle, also named Sum and Product Puzzle is a puzzle called "impossible" because it seems to lack sufficient information for a solution. It was first published in 1969 by Hans Freudenthal,〔Hans Freudenthal, Nieuw Archief Voor Wiskunde, Series 3, Volume 17, 1969, page 152〕 and the name ''Impossible Puzzle'' was coined by Martin Gardner.〔.〕 The puzzle is solvable, though not easily. There exist many similar versions of puzzles. ==Puzzle== ''X and Y are two different integers, greater than 1, with sum less than or equal to 100, with Y greater than X. S and P are two mathematicians; S knows the sum X+Y, P knows the product X *Y, and both are perfect logicians. Both S and P know the information in these two sentences. The following conversation occurs:'' * ''S says "P does not know X and Y."'' * ''P says "Now I know X and Y."'' * ''S says "Now I also know X and Y!"'' ''What are X and Y?'' 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Sum and Product Puzzle」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.